Cryptanalysis of chosen symmetric homomorphic schemes
نویسندگان
چکیده
منابع مشابه
Cryptanalysis of Chosen Symmetric Homomorphic Schemes
Since Gentry’s breakthrough result was introduced in the year 2009, the homomorphic encryption has become a very popular topic. The main contribution of Gentry’s thesis [9] was, that it has proven, that it actually is possible to design a fully homomorphic encryption scheme. However ground-breaking Gentry’s result was, the designs, that employ the bootstrapping technique suffer from terrible pe...
متن کاملCryptanalysis of the MORE symmetric key fully homomorphic encryption scheme
The fully homomorphic symmetric encryption scheme MORE encrypts keys by conjugation with a random invertible matrix over an RSA modulus. We provide a two known-ciphertexts cryptanalysis recovering a linear dependence among the two encrypted keys. 1. The FHE scheme MORE In their paper [1], Kipnis and Hibshoosh propose, among other things, to use the following type of fully homomorphic encryption...
متن کاملHomomorphic Encryption with Chosen-Ciphertext Security
We address the problem of constructing public-key encryption schemes that meaningfullycombine useful computability features with non-malleability. In particular, we investigate schemesin which anyone can change an encryption of an unknown messagem into an encryption of T (m)(as a feature), for a specific set of allowed functions T , but the scheme is “non-malleable” withrespect ...
متن کاملOn Homomorphic Encryption and Chosen-Ciphertext Security
Chosen-Ciphertext (IND-CCA) security is generally considered the right notion of security for a cryptosystem. Because of its central importance much effort has been devoted to constructing IND-CCA secure cryptosystems. In this work, we consider constructing IND-CCA secure cryptosystems from (group) homomorphic encryption. Our main results give natural and efficient constructions of IND-CCA secu...
متن کاملHomomorphic Signature Schemes
Privacy homomorphisms, encryption schemes that are also homomorphisms relative to some binary operation, have been studied for some time, but one may also consider the analogous problem of homomorphic signature schemes. In this paper we introduce basic definitions of security for homomorphic signature systems, motivate the inquiry with example applications, and describe several schemes that are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Scientiarum Mathematicarum Hungarica
سال: 2015
ISSN: 0081-6906,1588-2896
DOI: 10.1556/012.2015.52.2.1311